Uniform metrical task systems with a limited number of states
نویسندگان
چکیده
We give a randomized algorithm (the ”Wedge Algorithm”) of competitiveness 3 2 Hk − 1 2k for any metrical task system on a uniform space of k points, for any k ≥ 2, where Hk = P k i=1 1 i , the k harmonic number. This algorithm has better competitiveness than the Irani-Seiden algorithm if k is smaller than 10. The algorithm is better by a factor of 2 if k < 47.
منابع مشابه
Randomized Algorithms for Metrical Task Systems
Borodin, Linial, and Saks introduce a general model for online systems in BLS92] called task systems and show a deterministic algorithm which achieves a competitive ratio of 2n ?1 for any metrical task system with n states. We present a randomized algorithm which achieves a competitive ratio of e=(e?1)n?1=(e?1) 1:5820n?0:5820 for this same problem. For the uniform metric space, Borodin, Linial,...
متن کاملHESITANT FUZZY INFORMATION MEASURES DERIVED FROM T-NORMS AND S-NORMS
In this contribution, we first introduce the concept of metrical T-norm-based similarity measure for hesitant fuzzy sets (HFSs) {by using the concept of T-norm-based distance measure}. Then,the relationship of the proposed {metrical T-norm-based} similarity {measures} with the {other kind of information measure, called the metrical T-norm-based} entropy measure {is} discussed. The main feature ...
متن کاملMetrical Task Systems ( 1992 ; Borodin , Linial ,
Metrical task systems (MTS), introduced by Borodin, Linial, and Saks [5], is a cost minimization problem defined on a metric space (X, dX) and informally described as follows: A given system has a set of internal states X . The aim of the system is to perform a given sequence of tasks. The performance of each task has a certain cost that depends on the task and the state of the system. The syst...
متن کاملMetrical Task Systems and the k-Server Problem on HSTs
We consider the randomized k-server problem, and give improved results for various metric spaces. In particular, we extend a recent result of Coté et al [15] for well-separated binary Hierarchically Separated Trees (HSTs) to wellseparated d-ary HSTs for poly-logarithmic values of d. One application of this result is an exp(O( √ log log k log n))-competitive algorithm for k-server on n uniformly...
متن کاملDesigning a Robust Control Scheme for Robotic Systems with an Adaptive Observer
This paper introduces a robust task-space control scheme for a robotic system with an adaptive observer. The proposed approach does not require the availability of the system states and an adaptive observer is developed to estimate the state variables. These estimated states are then used in the control scheme. First, the dynamic model of a robot is derived. Next, an observer-based robust contr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 104 شماره
صفحات -
تاریخ انتشار 2007